Embedding problems for paths with direction constrained edges
نویسندگان
چکیده
منابع مشابه
Embedding Problems for Paths with Direction Constrained Edges
We determine the reachability properties of the embeddings in R of a directed path, in the graph-theoretic sense, whose edges have each been assigned a desired direction (East, West, North, South, Up, or Down) but no length. We ask which points of R can be reached by the terminus of an embedding of such a path, by choosing appropriate positive lengths for the edges, if the embedded path starts ...
متن کاملWindrose Planarity: Embedding Graphs with Direction-Constrained Edges
Given a planar graph G(V,E) and a partition of the neighbors of each vertex v ∈ V in four sets ↗ v, ↖ v, ↙ v, and ↘ v, the problem WINDROSE PLANARITY asks to decide whether G admits a windrose-planar drawing, that is, a planar drawing in which (i) each neighbor u ∈ ↗ v is above and to the right of v, (ii) each neighbor u ∈ ↖ v is above and to the left of v, (iii) each neighbor u ∈ ↙ v is below ...
متن کاملMotzkin Paths with Vertical Edges
This paper considers finite lattice paths formed from the set of step vectors {→, ↗,↘, ↑, and ↓} with the restriction that vertical steps (↑, ↓) can not be consecutive. We provide a recurrence relation for enumerating paths that terminate a horizontal distance n and vertical distance m from the starting point and apply the relation to paths which are restricted to the first quadrant and paths w...
متن کاملGraph Embedding through Random Walk for Shortest Paths Problems
We present a new probabilistic technique of embedding graphs in Z, the d-dimensional integer lattice, in order to find the shortest paths and shortest distances between pairs of nodes. In our method the nodes of a breath first search (BFS) tree, starting at a particular node, are labeled as the sites found by a branching random walk on Z. After describing a greedy algorithm for routing (distanc...
متن کاملA Note on Drawing Direction-constrained Paths in 3D
We study the problem of drawing a graph-theoretic path where each edge is assigned an axis-parallel direction in 3D. Di Battista et al.[3] gives a combinatorial characterization for such path drawings that start at the origin and reach a point in an octant. In this paper, we consider the drawability question for such paths that start at the origin and reach a point in a quadrant or an axis. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00408-x